An interactive polynomial approximation algorithm
نویسندگان
چکیده
منابع مشابه
Unicity in piecewise polynomial L1-approximation via an algorithm
Our main result shows that certain generalized convex functions on a real interval possess a unique best L1 approximation from the family of piecewise polynomial functions of fixed degree with varying knots. This result was anticipated by Kioustelidis in [11]; however the proof given there is nonconstructive and uses topological degree as the primary tool, in a fashion similar to the proof the ...
متن کاملUsing the Polynomial Approximation Algorithm in the Algorithm 2 for Manipulator's Control in an Unknown Environment
The Algorithm2 for a n-link manipulator movement amidst arbitrary unknown static obstacles for a case when a sensor system supplies information about local neighborhoods of different points in the configuration space is presented. The Algorithm2 guarantees the reaching of a target position in a finite number of steps. The Algorithm2 is reduced to a finite number of calls of a subroutine for pla...
متن کاملAn Approximation Error Lower Bound for Integer Polynomial Minimax Approximation
The need to solve a polynomial minimax approximation problem appears often in science. It is especially common in signal processing and in particular in filter design. The results presented in this paper originated from a study of the finite wordlength restriction in the FIR digital filter design problem. They are, however, much more general and can be applied to any polynomial minimax approxim...
متن کاملPolynomial Approximation
Polynomials are very simple mathematical functions which have the flexibility to represent very general nonlinear relationships. Approximation of more complicated functions by polynomials is a basic building block for many numerical techniques. This article considers two distinct but related applications. The first is polynomial regression in which polynomials are used to model a nonlinear rela...
متن کاملGeneral Constrained Polynomial Optimization: an Approximation Approach
In this paper, we consider approximation algorithms for optimizing a generic multi-variate (inhomogeneous) polynomial function, subject to some fairly general constraints. The focus is on the design and analysis of polynomial-time approximation algorithms. First, we study the problem of maximizing a polynomial function over the Euclidean ball. A polynomialtime approximation algorithm is propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1976
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/19.1.74